Learning Coverage Functions
نویسندگان
چکیده
We study the problem of approximating and learning coverage functions. A function c : 2 → R is a coverage function, if there exists a universe U with non-negative weights w(u) for each u ∈ U and subsets A1, A2, . . . , An of U such that c(S) = ∑ u∈∪i∈SAi w(u). Alternatively, coverage functions can be described as non-negative linear combinations of monotone disjunctions. They are a natural subclass of submodular functions and arise in a number of applications. We give an algorithm that for any γ, δ > 0, given random and uniform examples of an unknown coverage function c, finds a function h that approximates c within factor 1+γ on all but δ-fraction of the points in time poly(n, 1/γ, 1/δ). This is the first fully-polynomial algorithm for learning an interesting class of functions in the demanding PMAC model of Balcan and Harvey [BH12]. Our algorithm relies on first solving a simpler problem of learning coverage functions with low l1-error. Our algorithms are based on several new structural properties of coverage functions and, in particular, we prove that any coverage function can be ǫ-approximated in l1 by a coverage function that depends only on O(1/ǫ) variables. This is tight up to a constant factor. In contrast, we show that, without assumptions on the distribution, learning coverage functions is at least as hard as learning polynomialsize disjoint DNF formulas, a class of functions for which the best known algorithm runs in time 2 ) [KS04]. As an application of our result, we give a simple polynomial-time differentially-private algorithm for releasing monotone disjunction counting queries with low average error over the uniform distribution on disjunctions. Work done while the author was at IBM Research Almaden.
منابع مشابه
Learning Coverage Functions and Private Release of Marginals
We study the problem of approximating and learning coverage functions. A function c : 2 → R is a coverage function, if there exists a universe U with non-negative weights w(u) for each u ∈ U and subsets A1, A2, . . . , An of U such that c(S) = ∑ u∈∪i∈SAi w(u). Alternatively, coverage functions can be described as non-negative linear combinations of monotone disjunctions. They are a natural subc...
متن کاملLearning Time-Varying Coverage Functions
Coverage functions are an important class of discrete functions that capture the law of diminishing returns arising naturally from applications in social network analysis, machine learning, and algorithmic game theory. In this paper, we propose a new problem of learning time-varying coverage functions, and develop a novel parametrization of these functions using random features. Based on the co...
متن کاملPragmatic Representations in Iranian High School English Textbooks
Owing to the growing interest in communicative, cultural and pragmatic aspects of second language learning in recent years, the present study tried to investigate representations of pragmatic aspects of English as a foreign language in Iranian high school textbooks. Using Halliday’s (1978), and Searle’s (1976) models, different language functions and speech acts were specifically determined and...
متن کاملLearning Combinatorial Functions from Pairwise Comparisons
A large body of work in machine learning has focused on the problem of learning a close approximation to an underlying combinatorial function, given a small set of labeled examples. However, for real-valued functions, cardinal labels might not be accessible, or it may be difficult for an expert to consistently assign real-valued labels over the entire set of examples. For instance, it is notori...
متن کاملOn the Approximation of Submodular Functions
Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and these subclasses widely vary in their complexity. Our motivation is to understand the relative complexity of these classes of functions. Towards this, we conside...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1304.2079 شماره
صفحات -
تاریخ انتشار 2013